Strong Normalization Proofs
نویسنده
چکیده
We deene an equivalent variant LK sp of the Gentzen sequent calculus LK. In LK sp weakenings or contractions can be performed in parallel. This modiication allows us to interpret a symmetrical system of mix elimination rules E LKsp by a nite rewriting system; the termination of this rewriting system can be machine checked. We give also a self-contained strong normalization proof by structural induction. We give another strong normalization proof by a strictly monotone subrecursive interpretation; this interpretation gives subrecursive bounds for the length of derivations. We give a strong normalization proof by applying orthogonal term rewriting results for a connuent restriction of the mix elimination system E LKsp .
منابع مشابه
Short Proofs of Strong Normalization
This paper presents simple, syntactic strong normalization proofs for the simply-typed λ-calculus and the polymorphic λ-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The normalization proofs use translations of terms and types of λ→,∧,∨,⊥ to terms and types of λ→ and from F∀,∃,→,∧,∨,⊥ to F∀,→.
متن کاملArithmetical proofs of strong normalization results for the symmetric λμ-calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کامل7 M ay 2 00 9 Arithmetical proofs of strong normalization results for the symmetric λ μ - calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کاملStrong Normalization of Moggis's Computational Metalanguage
Handling variable binding is one of the main difficulties in formal proofs. In this context, Moggi’s computational metalanguage serves as an interesting case study. It features monadic types and a commuting conversion rule that rearranges the binding structure. Lindley and Stark have given an elegant proof of strong normalization for this calculus. The key construction in their proof is a notio...
متن کاملContinuous Semantics for Termination Proofs
We prove a general strong normalization theorem for higher type rewrite systems based on Tait’s strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Gödel’s system T , but also to various forms of bar recursion for which strong normalization was hitherto unknown.
متن کاملA Proof of Strong Normalization for F 2 , F ! and Beyond yD
We present an evaluation technique for proving strong normalization (SN). We use the technique to give SN proofs for F 2 , F-bounded quantiication, subtypes, and F !. The evaluation technique derives SN as a corollary of the soundness of the typing rules under an appropriate evaluation semantics. The evaluation semantics yields simpler type sets than those used in the earlier SN proofs. The typ...
متن کامل